#include "p_3_2.h"
#include "pro.h"
#include <iostream>
#include <algorithm>
#include <functional>
#include <iterator>

using namespace std;

int main(){


	int a[] = {0,1,-1,-7,-2,-9,-3};
	make_heap(a,a+sizeof(a)/sizeof(int));
	cout<<a[0]<<endl;
	make_heap(a,a+sizeof(a)/sizeof(int),greater<int>());
	cout<<a[0]<<endl;

	//copy(a, a+5, ostream_iterator<int>(cout,"  "));
	//cout<<endl;
	//_make_heap(a,a+5);
	//copy(a, a+5, ostream_iterator<int>(cout,"  "));
	//cout<<endl;
	//_push_heap(a,a+6);
	//copy(a, a+6, ostream_iterator<int>(cout,"  "));
	//cout<<endl;
	//_push_heap(a,a+7);
	//copy(a, a+7, ostream_iterator<int>(cout,"  "));
	//cout<<endl;
	//_pop_heap(a,a+7);
	//copy(a, a+7, ostream_iterator<int>(cout,"  "));
	//cout<<endl;
//int* p = partition(a, a+5,bind2nd(less_equal<int>(),0));
	//cout<<*p<<endl;
	//pro_2_5();
	//pro_2_2();
	//tel_search(number,answer,tel_len);
	//cout<<"__________________________________________________";
	//cout<<endl;
	//recursive_tel_search(number,answer,tel_len,tel_len);
	
	return 0;
}
